A low-complexity scheduling algorithm for proportional fairness in body area networks

Pulse-coupled oscillator networks are a system of pulsing devices that alter their pulsing patterns in response to the pulsing events at other nodes. It is well known that these networks can produce a number of different pulsing patterns, among which the synchrony of pulsing. The primitive we study in this paper belongs to the class of desynchronization algorithms whose objective is collision resolution in networks with extremely low power devices, which also are bound to have very low complexity. In this paper, we introduce a new decentralized scheduling algorithm based on the coupled oscillator model to achieve a schedule that allows to multiplex in time a small network of very simple transmission devices, based on the requests negotiated by the nodes.